Interpolation functor and computability
نویسنده
چکیده
Computability of Banach spaces is discussed. A compatible relation is shown to hold between the complex interpolation spaces of Calder) on (Studia Math. 24 (1964) 113) and the computability structures introduced by Pour-El and Richards (Computability in Analysis and Physics, Springer, Berlin, 1989). Namely, it is veri5ed that Calder) on’s original construction of the complex interpolation functor is valid in the context of computability if a mild e7ective separability condition is ful5lled by a compatible couple of Banach spaces. c © 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Interpolation Categories for Homology Theories
For a homological functor from a triangulated category to an abelian category satisfying some technical assumptions we construct a tower of interpolation categories. These are categories over which the functor factorizes and which capture more and more information according to the injective dimension of the images of the functor. The categories are obtained by using truncated versions of resolu...
متن کاملThe Lter Construction Revisited
The lter construction, as an endo-functor on the category of small coherent categories, was used extensively by A. Pitts in a series of papers in the 80's to prove completeness and interpolation results. Later I. Moerdijk and E. Palmgren used the lter construction to construct non-standard models of Heyting arithmetic. In this paper we describe lter construction as a left-adjoint: applied to a ...
متن کاملWeihrauch-completeness for layerwise computability
Layerwise computability is an effective counterpart to continuous functions that are almosteverywhere defined. This notion was introduced by Hoyrup and Rojas [17]. A function defined on Martin-Löf random inputs is called layerwise computable, if it becomes computable if each input is equipped with some bound on the layer where it passes a fixed universal Martin-Löf test. Interesting examples of...
متن کاملCs 468 – Winter 2004 6.1 Chains and Cycles
In Lecture 3, we learned about a combinatorial method for representing spaces. In Lecture 4, we studied groups and equivalence relations implied by their normal subgroups. In this lecture, we look at a combinatorial and computable functor called homology that gives us a finite description of the topology of a space. Homology groups may be regarded as an algebraization of the first layer of geom...
متن کاملEnhancing Demosaicking Algorithms using Loopy Propagation
Consumer-level digital cameras observe a single value at each pixel. The remaining two channels of a three-channel image are reconstructed through a process called demosaicking. This paper describes a methodology for enhancing current demosaicking methods. Using an iterative relaxation approach from probabilistic AI literature, our empirical results show that we can improve the results of the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 284 شماره
صفحات -
تاریخ انتشار 2002